Optimal cuts and partitions in tree metrics in polynomial time
نویسندگان
چکیده
منابع مشابه
Optimal Cuts and Partitions in Tree Metrics in Polynomial Time
We present a polynomial time dynamic programming algorithm for optimal partitions in the shortest path metric induced by a tree. This resolves, among other things, the exact complexity status of the optimal partition problems in one dimensional geometric metric settings. Our method of solution could be also of independent interest in other applications. We discuss also an extension of our metho...
متن کاملOptimal Cuts and Bisections on the Real Line in Polynomial Time
The exact complexity of geometric cuts and bisections is the longstanding open problem including even the dimension one. In this paper, we resolve this problem for dimension one (the real line) by designing an exact polynomial time algorithm. Our results depend on a new technique of dealing with metric equalities and their connection to dynamic programming. The method of our solution could be a...
متن کاملSegmentation of Liver Tumor Using Efficient Global Optimal Tree Metrics Graph Cuts
We propose a novel approach that applies global optimal tree-metrics graph cuts algorithm on multi-phase contrast enhanced contrast enhanced MRI for liver tumor segmentation. To address the difficulties caused by low contrasted boundaries and high variability in liver tumor segmentation, we first extract a set of features in multi-phase contrast enhanced MRI data and use color-space mapping to ...
متن کاملOn Equivalences, Metrics, and Polynomial Time
Interactive behaviors are ubiquitous in modern cryptography, but are also present in λcalculi, in the form of higher-order constructions. Traditionally, however, typed λ-calculi simply do not fit well into cryptography, being both deterministic and too powerful as for the complexity of functions they can express. We study interaction in a λ-calculus for probabilistic polynomial time computable ...
متن کاملmanipulation in dubbing and subtitling
پژوهش حاضر در چارچوب مکتب دستکاری قرار گرفت و با استفاده از تقسیم بندی دوکات (2007) از شیوه های دستکاری، به دنبال یافتن پاسخ برای پرسش های زیر بود: 1-رایج ترین شیوه دستکاری در دوبله فیلم ها کدام است؟ 2-رایج ترین شیوه دستکاری در زیرنویس فیلم ها کدام است؟ 3-دستکاری در دوبله فیلم ها رایج تر است یا در زیرنویس آن ها؟ این پژوهش از نوع تحقیقات توصیفی- مقایسه ای و پیکره ای می باشد. پیکره تحقیق شا...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2013
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2013.03.009